Rigorous Error Analysis of Numerical Algorithms via Symbolic Computations
نویسندگان
چکیده
منابع مشابه
Rigorous Error Analysis of Numerical Algorithms via Symbolic Computations
1. Introduction. Like the goal of combinatorial algorithms is to construct certain combinatorial objects by means of some elementary operations, the goal of numerical algorithms is to construct some real numbers by means of the four elementary arithmetic operations: addition, subtraction, multiplication and division. The diierence is that the set of real numbers is uncountable and as a conseque...
متن کاملNumerical Algorithms for Symbolic Analysis of Large Circuits
This paper presents an algorithm for fast large-change sensitivity computation for approximate symbolic analysis. The sensitivity is used for identifying negligible elements of circuit model that can be removed in order to simplify symbolic solution. The method is based on combination of the Sherman-Morison formula and sparse matrix techniques. Effectiveness of the method was tested on several ...
متن کاملStationary Coexistence of Hexagons and Rolls via Rigorous Computations
In this work we introduce a rigorous computational method for finding heteroclinic solutions of a system of two second order differential equations. These solutions correspond to standing waves between rolls and hexagonal patterns of a two-dimensional pattern formation PDE model. After reformulating the problem as a projected boundary value problem (BVP) with boundaries in the stable/unstable m...
متن کاملAlgorithms for Rigorous Entropy Bounds and Symbolic Dynamics
The aim of this paper is to introduce a method for computing rigorous lower bounds for topological entropy. The topological entropy of a dynamical system measures the number of trajectories that separate in finite time and quantifies the complexity of the system. Our method relies on extending existing computational Conley index techniques for constructing semi-conjugate symbolic dynamical syst...
متن کاملRigorous Computations of Homoclinic Tangencies
In this paper, we propose a rigorous computational method for detecting homoclinic tangencies and structurally unstable connecting orbits. It is a combination of several tools and algorithms, including the interval arithmetic, the subdivision algorithm, the Conley index theory, and the computational homology theory. As an example we prove the existence of generic homoclinic tangencies in the Hé...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0061